Performance Analysis and True Concurrency Semantics

نویسندگان

  • Ed Brinksma
  • Joost-Pieter Katoen
  • Rom Langerak
  • Diego Latella
چکیده

Thi s paper addresses the subject of linking functional speciications to performance analysi s i n a process al gebrai c context. It presents a timed, probabilistic extension of a process al gebrai c formal i sm and its application to performance analysis. More specii-cally, an extensi on of a subset of LOTOS is presented equipped with a truly concurrent semanti cal model based on bundl e event structures. It is investigated how semi-Markov chains can be obtai ned from functional speciications using this semantical model. The use of a true concurrency model enables us to distinguish between non-determinism and paral l el i sm, to reduce the state explosion problem and, moreover, to analyse part of the system wi thout consi deri ng other (irrelevant) parts. An example illustrates the proposed approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Locality and True-concurrency in Calculi for Mobile Processes

Process algebra semantics can be categorised into true-concurrency semantics, where parallel composition is considered a primitive operator, and interleaving semantics, where concurrency is reduced to sequentiality plus non-determinism. The former have an appealing intuitive justiication, but the latter are mathematically more tractable. This paper addresses the study of true-concurrency semant...

متن کامل

Asynchronous Games 2: The True Concurrency of Innocence

In game semantics, the higher-order value passing mechanisms of the λ-calculus are decomposed as sequences of atomic actions exchanged by a Player and its Opponent. Seen from this angle, game semantics is reminiscent of trace semantics in concurrency theory, where a process is identified to the sequences of requests it generates in the course of time. Asynchronous game semantics is an attempt t...

متن کامل

Tree Automata for Analyzing Dynamic Pushdown Networks

Dynamic Pushdown Networks (DPNs) are an abstract model for concurrent programs with recursive procedures and dynamic process creation. Usually, DPNs are described with an interleaving semantics, where an execution is a sequence of steps. Recently, we introduced a true-concurrency semantics for DPNs, where executions are trees. The standard analysis methods for DPNs are based on a saturation alg...

متن کامل

Petri Nets Semantics of P-calculus

As p-calculus based on the interleaving semantics cannot depict the true concurrency and has few supporting tools, it is translated into Petri nets. p-calculus is divided into basic elements, sequence, concurrency, choice and recursive modules. These modules are translated into Petri nets to construct a complicated system. Petri nets semantics for p-calculus visualize system structure as well a...

متن کامل

Modeling Systems by Probabilistic Process Algebra: an Event Structures Approach

Performance and reliability analysis of distributed systems based on formal specifications is an important and widely recognized issue. This paper treats a probabilistic version of (a subset of) the process algebra LOTOS. It incorporates a probabilistic choice assigning a probability of occurrence to each of its alternatives. Opposed to the traditional interleaving semantics used for existing p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994